package com.example.algorithm.no0021.solution;

import com.example.algorithm.no0021.ListNode;
import com.example.algorithm.no0021.Solution;

/**
 * @Description 解答实现-合并两个有序链表-递归
 * @ClassName StackSolutionImpl
 * @Author Administrator
 * @Date 2020/5/16 12:48
 * @Version 1.0.0
 */
public class DiguiSolutionImpl implements Solution {
    @Override
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        }
        else if (l2 == null) {
            return l1;
        }
        else if (l1.val < l2.val) {
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        }
        else {
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }
    }
}
